CLP(PB), A Meta-Interpreter in CLP(R)

Constraint logic programming is one of the most attractive research areas in logic programming. Due to [JL87] the theoretical foundation of a general constraint logic programming language scheme CLP(X ) is available. Unfortunately, implementing a CLP(X ) system for some domain X is a difficult task. The problematic points are providing a constraint solver and ensuring the incrementality of the constraint system. We propose here to use an existing CLP system as implementation environment for a new CLP language. We show that under certain conditions we can use the given constraint solver as constraint solver for the new CLP-language. We focus here on prototyping CLP(PB), where PB denotes the structure of pseudo-Boolean functions, in CLP(R), where R denotes the structure of real numbers.